On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings
نویسنده
چکیده
Let M, N be two matchings on [2n] (possibly M = N) and for an integer l ≥ 0 let T (M, l) be the set of those matchings on [2n + 2l] which can be obtained from M by successively adding l times in all ways the first edge, and similarly for T (N, l). Let s, t ∈ {cr, ne} where cr is the statistic of the number of crossings (in a matching) and ne is the statistic of the number of nestings (possibly s = t). We prove that if the statistics s and t coincide on the sets of matchings T (M, l) and T (N, l) for l = 0, 1, they must coincide on these sets for every l ≥ 0; similar identities hold for the joint statistic of cr and ne. These results are instances of a general identity in which crossings and nestings are weighted by elements from an abelian group.
منابع مشابه
Distribution of Crossings, Nestings and Alignments of Two Edges in Matchings and Partitions
We construct an involution on set partitions which keeps track of the numbers of crossings, nestings and alignments of two edges. We derive then the symmetric distribution of the numbers of crossings and nestings in partitions, which generalizes a recent result of Klazar and Noy in perfect matchings. By factorizing our involution through bijections between set partitions and some path diagrams ...
متن کاملk-DISTANT CROSSINGS AND NESTINGS OF MATCHINGS AND PARTITIONS
We define and consider k-distant crossings and nestings for matchings and set partitions, which are a variation of crossings and nestings in which the distance between vertices is important. By modifying an involution of Kasraoui and Zeng (Electronic J. Combinatorics 2006, research paper 33), we show that the joint distribution of k-distant crossings and nestings is symmetric. We also study the...
متن کاملEquidistributed Statistics on Matchings and Permutations
We show that the bistatistic of right nestings and right crossings in matchings without left nestings is equidistributed with the number of occurrences of two certain patterns in permutations, and furthermore that this equidistribution holds when refined to positions of these statistics in matchings and permutations. For this distribution we obtain a non-commutative generating function which sp...
متن کاملCrossings and Nestings of Two Edges in Set Partitions
Let π and λ be two set partitions with the same number of blocks. Assume π is a partition of [n]. For any integer l,m ≥ 0, let T (π, l) be the set of partitions of [n+ l] whose restrictions to the last n elements are isomorphic to π, and T (π, l,m) the subset of T (π, l) consisting of those partitions with exactly m blocks. Similarly define T (λ, l) and T (λ, l,m). We prove that if the statisti...
متن کاملTwo New Interpretations of the Fishburn Numbers and Their Refined Generating Functions
We show that two classes of combinatorial objects–inversion tables with no subsequence of decreasing consecutive numbers and matchings with no 2-nestings–are enumerated by the Fishburn numbers. In particular, we give a simple bijection between matchings with no 2-nestings and inversion tables with no subsequence of decreasing consecutive numbers. We then prove using the involution principle tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 20 شماره
صفحات -
تاریخ انتشار 2006